Grail: a functional form for imperative mobile code

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grail: a functional form for imperative mobile code

In Robert Louis Stevenson’s novel [31], Dr Jekyll is a well-regarded member of polite society, while his alter ego Mr Hyde shares the same physical form but roams abroad communing with the lowest elements. In this paper we present Grail, a well-behaved first-order functional language that is the target for an ML-like compiler; while also being a wholly imperative language of assignments that tr...

متن کامل

A Mobile Functional Object Code

This paper introduces a monadic object code for functional languages that allows an architecture independent, compact representation of program modules; it includes support for distributed applications by featuring a lightweight thread model and asymmetric communication. It proposes to ooset ineeciencies introduced by the architecture independence by specialising and optimising the code before ...

متن کامل

A Type System for Functional Imperative

In this paper, we explore the design of a powerful type system that provides a general mechanism to encapsulate low-level imperative program fragments into type-safe functional abstractions without imposing any single-threadedness constraint. Although connuence is the responsibility of the user, the type system guarantees that data-structures exported out of the functional abstraction are fully...

متن کامل

Functional Programming for Imperative Programmers

This document introduces functional programming for those that are used to imperative languages, but are trying to come to terms with recursion and other techniques used in functional programming. We use OCaml as the primary language, and we assume that the reader has been introduced to its basic syntax and features. The goal of this document is to help these programmers get more comfortable wi...

متن کامل

Imperative abstractions for functional actions

We elaborate our relational model of non-strict, imperative computations. The theory is extended to support infinite data structures. To facilitate their use in programs, we extend the programming language by concepts such as procedures, parameters, partial application, algebraic data types, pattern matching and list comprehensions. For each concept, we provide a relational semantics. Abstracti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2003

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(05)80083-0